A Constant-Time Algorithm for Middle Levels Gray Codes
نویسندگان
چکیده
منابع مشابه
A constant-time algorithm for middle levels Gray codes
For any integer n ≥ 1 a middle levels Gray code is a cyclic listing of all nelement and (n+ 1)-element subsets of {1, 2, . . . , 2n+ 1} such that any two consecutive subsets differ in adding or removing a single element. The question whether such a Gray code exists for any n ≥ 1 has been the subject of intensive research during the last 30 years, and has been answered affirmatively only recentl...
متن کاملEfficient Computation of Middle Levels Gray Codes
For any integer n ≥ 1 a middle levels Gray code is a cyclic listing of all bitstrings of length 2n+1 that have either n or n+1 entries equal to 1 such that any two consecutive bitstrings in the list differ in exactly one bit. The question whether such a Gray code exists for every n ≥ 1 has been the subject of intensive research during the last 30 years, and has been answered affirmatively only ...
متن کاملMonotone Gray Codes and the Middle Levels Problem
An n-bit binary Gray code is an enumeration of all n-bit binary strings so that successive elements differ in exactly one bit position; equivalently, a hamilton path in the Hasse diagram of Bn (the partially ordered set of subsets of an n-element set, ordered by inclusion.) We construct, for each n, a hamilton path in Bn with the following additional property: edges between levels i− 1 and i of...
متن کاملGray Codes, Loopless Algorithm and Partitions
The generation of efficient Gray codes and combinatorial algorithms that list all the members of a combinatorial object has received a lot of attention in the last few years. Knuth gave a code for the set of all partitions of [n] = {1, 2, . . . , n}. Ruskey presented a modified version of Knuth’s algorithm with distance 2. Ehrlich introduced a looplees algorithm for the set of the partitions of...
متن کاملIsotropic Constant Dimension Subspace Codes
In network code setting, a constant dimension code is a set of k-dimensional subspaces of F nq . If F_q n is a nondegenerated symlectic vector space with bilinear form f, an isotropic subspace U of F n q is a subspace that for all x, y ∈ U, f(x, y) = 0. We introduce isotropic subspace codes simply as a set of isotropic subspaces and show how the isotropic property use in decoding process, then...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 2019
ISSN: 0178-4617,1432-0541
DOI: 10.1007/s00453-019-00640-2